Drawing graphs on rectangular grids
نویسندگان
چکیده
منابع مشابه
Drawing Series-Parallel Graphs on Restricted Integer 3D Grids
D Di ip pa ar rt ti im me en nt to o d di i I In ng ge eg gn ne er ri ia a E El le et tt tr ro on ni ic ca a e e d de el ll l' 'i in nf fo or rm ma az zi io on ne e
متن کاملConstrained C1 Interpolation on Rectangular Grids
.This paper is concerned with the range restricted interpolation of 'data on rectangular grids. The interpolant is constrained to lie on the same side of the constraint surface as the data. Sufficient non-negativity conditions on the Bezier ordinates are derived to ensure the non-negativity of a bicubic Bezier patch. The method modifies Bezier ordinates locally to fulfill the sufficient non-neg...
متن کاملDrawing Unordered Trees on k-Grids
We present almost linear area bounds for drawing complete trees on the octagonal grid. For 7-ary trees we establish an upper and lower bound of Θ(n1.129) and for ternary trees the bounds of O(n1.048) and Θ(n), where the latter needs edge bends. We explore the unit edge length and area complexity of drawing unordered trees on k-grids with k ∈ {4, 6, 8} and generalize the N P-hardness results of ...
متن کاملDrawing Graphs Within Graphs
The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality. We introduce connection sets stressing relationships between several subgraphs. In a case study, we demonstrate how they ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00020-e